On distribution function of the diameter in uncertain graph

نویسندگان

  • Yuan Gao
  • Lixing Yang
  • Shukai Li
  • Samarjit Kar
چکیده

In uncertain graphs, the existence of some edges is not predetermined. The diameter of an uncertain graph is essentially an uncertain variable, which indicates the suitability for investigation of its distribution function. The main focus of this paper is to propose an algorithm to determine the distribution function of the diameter of an uncertain graph. We first discuss the characteristics of the uncertain diameter, and the the distribution function is derived. An efficient algorithm is designed based on Floyd’s algorithm. Further, some numerical examples are illustrated to show the efficiency and application of the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

متن کامل

Adaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems

This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...

متن کامل

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

طراحی و ساخت لایه‌های نازک اپتیکی با نمایه ضخامت متغیر برای تولید آینه‌های VRM

  The design method and fabrication of mirrors with variable reflectivity are presented. To fabricate such a mirror a fixed mask with a circular aperture is used. The circular aperture is considered as an extended source with cosx(θ)as its diffusion distribution function and is the parameter for the distribution function of the particles through the aperture. The thickness profile of deposited ...

متن کامل

On the diameter of the commuting graph of the full matrix ring over the real numbers

‎In a recent paper C‎. ‎Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$‎. ‎But the case $n=4$ remained open‎, ‎since the diameter could be $4$ or $5$‎. ‎In this work we close the problem showing that also in this case the diameter is $4$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 296  شماره 

صفحات  -

تاریخ انتشار 2015